|
Shape grammars in computation are a specific class of production systems that generate geometric shapes. Typically, shapes are 2- or 3-dimensional, thus shape grammars are a way to study 2- and 3-dimensional languages. The foundation of shape grammars has been defined in a seminal article by George Stiny and James Gips in 1971.〔Stiny, G. & Gips, J. (1972). Shape grammars and the generative specification of painting and sculpture. In Information Processing 71, 1460–1465. North-Holland Publishing Company.〕 ==Definition== A shape grammar consists of ''shape rules'' and a ''generation engine'' that selects and processes rules. A shape rule defines how an existing (part of a) shape can be transformed. A shape rule consists of two parts separated by an arrow pointing from left to right. The part left of the arrow is termed the ''Left-Hand Side'' (LHS). It depicts a condition in terms of a shape and a marker. The part right of the arrow is termed the ''Right-Hand Side'' (RHS). It depicts how the LHS shape should be transformed and where the marker is positioned. The marker helps to locate and orient the new shape. A shape grammar minimally consists of three shape rules: a ''start rule'', at least one transformation rule, and a ''termination rule''. The start rule is necessary to start the shape generation process. The termination rule is necessary to make the shape generation process stop. The simplest way to stop the process is by a shape rule that removes the marker. Shape grammars differ from Chomsky grammars a major respect: the production rules may be applied serially (as with Chomsky grammars) or in parallel (not allowed in Chomsky grammars), similar to the way "productions" are done in L-Systems. A shape grammar system additionally has a working area where the created geometry is displayed. The generation engine checks the existing geometry, often referred to as ''Current Working Shape'' (CWS), for conditions that match the LHS of the shape rules. Shape rules with matching LHS are eligible for use. If more than one rule applies, the generation engine has to choose which rule to apply. In the alternative scenario, the engine first chooses one of the grammar rules and then tries to find all matches of the LHS of this rule in the CWS. If there are several matches, the engine can (depending on its configuration/implementation) *apply the rule to all matches in parallel, *apply the rule to all matches serially (which might lead to inconsistencies) or *choose one of the detected matches and apply the rule to only this match. Shape grammars are most useful when confined to a small, well-defined generation problem such as housing layouts and structure refinement. Because shape rules typically are defined on small shapes, a shape grammar can quickly contain a lot of rules. The palladian villas shape grammar presented by William Mitchell〔Mitchell, W. (1990). The Logic of Architecture. MIT Press, London.〕 for example contains 69 rules, that are applied throughout eight stages. Parametric shape grammars are an extension of shape grammars.〔Stiny, G. (1980). Introduction to shape and shape grammars. Environment and Planning B: Planning and Design 7(3), 343-351.〕 The new shape in the RHS of the shape rule is defined by parameters so that it can take into account more of the context of the already existing shapes. This typically affects internal proportions of the new shape so that a greater variety of forms can be created. In this way, attempts are made to make shape grammars respond to structural conditions, for example the width of beams in roof structures which depends on span. Despite their popularity and applicability in academic circles, shape grammars have not found widespread use in generic Computer Aided Design applications. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Shape grammar」の詳細全文を読む スポンサード リンク
|